Evolutionary heuristic for makespan minimization in no-idle flow shop production systems

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times

This paper presents an enhanced heuristic for minimizing the makespan of the ow shop scheduling problem with sequence-dependent setup times. The procedure transforms an instance of the problem into an instance of the traveling salesman problem by introducing a cost function that penalizes for both large setup times and bad tness of schedule. This hybrid cost function is an improvement over earl...

A new Nawaz–Enscore–Ham-based heuristic for permutation flow- shop problem with bicriteria of makespan and machine idle-time

Makespan Minimization on Three-Machine Flow shop with deteriorating jobs

In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job’s processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can ...

A New Heuristic Method for Minimizing the Makespan in a No-idle Permutation Flowshop

This paper deals with the no-idle permutation flowshop sequencing in order to minimize the total time of completing the schedule (makespan). A heuristic denoted by NB is introduced, which is compared with the best heuristics reported in the literature. An extensive computational experiment was carried out for the performance evaluation of the proposed heuristic. Experimental results clearly sho...